Diagnosis and Debugging as Contradiction Removal in Logic Programs

نویسندگان

  • Luís Moniz Pereira
  • Carlos Viegas Damásio
  • José Júlio Alferes
چکیده

We apply to normal logic programs with integrity rules a contradiction removal approach, and use it to uniformly treat diagnosis and debugging, and as a matter of fact envisage programs as artifacts and fault-nding as debugging. Our originality resides in applying to such programs the principle that if an assumption leads to contradiction then it should be revised: assumptions are not A literals with no rules for A; contradiction is violation of an integrity rule; and revision consists in assuming A instead. Since revised assumptions may introduce fresh contradictions the revision process must be iterated. To do so we've devised an algorithm which is sound and complete. Our use of normal logic programs extends that of Horn programs made by Konolige, and so adds expressiveness to the causal part of his framework. Non-abnormalities are assumed rather than abduced, and are revised only if they result in contradiction; simple logic programming techniques achieve it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Debugging by Diagnosing Assumptions

We present a novel and uniform technique for normal logic program declarative error diagnosis. We lay down the foundations on a general approach to diagnosis using logic programming, and bring out the close relationship between debugging and fault{{nding. Diagnostic debugging can be enacted by contradiction removal methods. It relies on a simple program transformation to provide a contradiction...

متن کامل

Optative Reasoning with Scenario Semantics

The scenario semantics of extended logic programs builds upon simple primitive notions and has been shown to encompass many important logic program semantics. Here we introduce into the scenario semantics paradigm a general exible notion of optative acceptance of acceptable hypotheses, and proceed to illustrate its application to fault diagnosis, taxonomic reasoning, and declarative logic progr...

متن کامل

Contradiction: When Avoidance Equals Removal - Part I

Recently several authors have stressed and illustrated the importance of including a second kind of negation (explicit negation) in logic programs besides \negation as failure", and its use in deductive databases, knowledge representation, and nonmonotonic reasoning. By introducing explicit negation into logic programs contradiction may appear. In this work we present two approaches for dealing...

متن کامل

Contradiction: When Avoidance Equals Removal - Part II

This paper is the continuation of 1] in this volume. There we present a sceptical semantics which avoids contradiction for extended logic programs plus integrity contraints in the form of denials, based on the notion of optative hypotheses {an abductive approach. In this part we deene a program revision method for removing contradiction from contradictory programs under WFSX, based on the notio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993